A Public Reference Implementation of the RAP Anaphora Resolution Algorithm
نویسندگان
چکیده
This paper describes a standalone, publicly-available implementation of the Resolution of Anaphora Procedure (RAP) given by Lappin and Leass (1994). The RAP algorithm resolves third person pronouns, lexical anaphors, and identifies pleonastic pronouns. Our implementation, JavaRAP, fills a current need in anaphora resolution research by providing a reference implementation that can be benchmarked against current algorithms. The implementation uses the standard, publicly available Charniak (2000) parser as input, and generates a list of anaphora-antecedent pairs as output. Alternately, an in-place annotation or substitution of the anaphors with their antecedents can be produced. Evaluation on the MUC-6 co-reference task shows JavaRAP has an accuracy of 57.9%, similar to the performance given previously in the literature (e.g., Preiss 2002).
منابع مشابه
An Extensive Evaluation of Anaphora Resolution Based Abstract Generation System
This paper presents an extensive evaluation of anaphora resolution (AR) algorithm proposed for Abstract Generation System (AGS) and discusses the metrics used to measure its performance. The evaluation exercise is conducted with the test sets chosen from different domains and the results are compared with other existing open-source Anaphora Resolution Systems (ARSs) like Mitkov’s Anaphora Resol...
متن کاملA Flexible Architecture for Reference Resolution
This paper describes an architecture for performing anaphora resolution in a flexible way. Systems which conform to these guidelines are wellencapsulated and portable, and can be used to compare anaphora resolution techniques for new language understanding applications. Our implementation of the architecture in a pronoun resolution testing platform demonstrates the flexibility of the approach.
متن کاملAnaphora for Everyone: Pronominal Anaphora Resolution without a Parser
We present an algorithm for anaphora resolution which is a modified and extended version of that developed by (Lappin and Leass, 1994). In contrast to that work, our algorithm does not require in-depth, full, syntactic parsing of text. Instead, with minimal compromise in output quality, the modifications enable the resolution process to work from the output of a part of speech tagger, enriched ...
متن کاملWhat Treebanks Can Do For You: Rule-based and Machine-learning Approaches to Anaphora Resolution in German
This paper compares two approaches to computational anaphora resolution for German: (i) an adaption of the rule-based RAP algorithm that was originally developed for English by Lappin and Leass, and (ii) a hybrid system for anaphora resolution that combines a rule-based pre-filtering component with a memory-based resolution module. The data source is provided by the TüBa-D/Z treebank of Ger-man...
متن کاملA General-Purpose, Off-the-shelf Anaphora Resolution Module: Implementation and Preliminary Evaluation
GuiTAR is an anaphora resolution system designed to be modular and usable as an off-the-shelf component of a NL processing pipeline. We discuss the system’s design and a preliminary evaluation of the two algorithms implemented in the current version of the system – for definite descriptions and for pronoun resolution.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.CL/0406031 شماره
صفحات -
تاریخ انتشار 2004